Series Jackson Networks and Noncrossing Probabilities
نویسندگان
چکیده
منابع مشابه
Asymptotics of overflow probabilities in Jackson networks
We consider the probability that the total population of a Jackson network exceeds a given large value. By using the relation to the stationary distribution, we derive upper and lower bounds on this probability. These bounds imply a stronger logarithmic limit when multiple nodes have the same maximal load.
متن کاملJackson : Social and Economic Networks
Matthew O. Jackson: Social and Economic Networks is published by Princeton University Press and copyrighted, © 2008, by Princeton University Press. All rights reserved. No part of this book may be reproduced in any form by any electronic or mechanical means (including photocopying, recording, or information storage and retrieval) without permission in writing from the publisher, except for read...
متن کاملAnalysis of a Splitting Estimator for Rare Event Probabilities in Jackson Networks
We consider a standard splitting algorithm for the rare-event simulation of overflow probabilities in any subset of stations in a Jackson network at level n, starting at a fixed initial position. It was shown in [8] that a subsolution to the Isaacs equation guarantees that a subexponential number of function evaluations (in n) suffice to estimate such overflow probabilities within a given relat...
متن کاملNoncrossing Trees and Noncrossing Graphs
Abstract. We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretation of a formula on noncrossing trees and symmetric ternary trees in answer to a problem proposed by Hough. We use the representation of Panholzer and Prodinger for noncrossing trees and find a correspondence between a class of noncrossing trees, called proper noncrossing trees, and the...
متن کاملImportance sampling for Jackson networks
Rare event simulation in the context of queueing networks has been an active area of research for more than two decades. A commonly used technique to increase the efficiency of Monte Carlo simulation is importance sampling. However, there are few rigorous results on the design of efficient or asymptotically optimal importance sampling schemes for queueing networks. Using a recently developed ga...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2010
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.1090.0421